Local-Set-Based Graph Signal Reconstruction
نویسندگان
چکیده
منابع مشابه
Bandlimited graph signal reconstruction by diffusion operator
Signal processing on graphs extends signal processing concepts and methodologies from the classical signal processing theory to data indexed by general graphs. For a bandlimited graph signal, the unknown data associated with unsampled vertices can be reconstructed from the sampled data by exploiting the spatial relationship of graph signal. In this paper, we propose a generalized analytical fra...
متن کاملPoint set silhouettes via local reconstruction
We present an algorithm to compute the silhouette set of a point cloud. Previous methods extract point set silhouettes by thresholding point normals, which can lead to simultaneous overand under-detection of silhouettes. We argue that additional information such as surface curvature is necessary to resolve these issues. To this end, we develop a local reconstruction scheme using Gabriel and int...
متن کاملUnifying local and non-local signal processing with graph CNNs
This paper deals with the unification of local and non-local signal processing on graphs within a single convolutional neural network (CNN) framework. Building upon recent works on graph CNNs, we propose to use convolutional layers that take as inputs two variables, a signal and a graph, allowing the network to adapt to changes in the graph structure. In this article, we explain how this framew...
متن کاملGraph-based Conservative Surface Reconstruction
We propose a new approach for reconstructing a 2-manifold from a point sample in R3. Compared to previous algorithms, our approach is novel in that it throws away geometry information early on in the reconstruction process and mainly operates combinatorially on a graph structure. Furthermore, it is very conservative in creating adjacencies between samples in the vicinity of slivers, still we ca...
متن کاملReconstruction of the set of branches of a graph
It is proved that the set of branches of a graph G is reconstructible except in a very special case. More precisely the set of branches of a graph G is reconstructible unless all the following hold: (1) the pruned center of G is a vertex or an edge, (2) G has exactly two branches, (3) one branch contains all the vertices of degree one of G and the other branch contains exactly one end-block. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2015
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2015.2411217